import java.util.BitSet;

/**
 * @Author: Liu, Yunfeng
 * @DateTime: 2021/7/23 22:11
 * @Description: TODO
 */
public class isCovered {
    public boolean isCovered(int[][] ranges, int left, int right) {
        BitSet bitSet = new BitSet();
        for(int[] range : ranges){
            bitSet.set(range[0],range[1]+1);
        }
        int i = bitSet.nextClearBit(left);
        return i >right;
    }
}
